Search results for "Square root"
showing 10 items of 16 documents
Rationalizability of square roots
2021
Abstract Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a solution in terms of these functions is to rationalize all occurring square roots by a suitable variable change. In this paper, we give a rigorous definition of rationalizability for square roots of ratios of polynomials. We show that the problem of deciding whether a single square root is rationalizable can be reformulated in geometrical terms. Using this approach, we give easy criteria to decide rationalizability in most cases of square roots i…
ASYMPTOTIC ANALYSIS OF THE LINEARIZED NAVIER–STOKES EQUATION ON AN EXTERIOR CIRCULAR DOMAIN: EXPLICIT SOLUTION AND THE ZERO VISCOSITY LIMIT
2001
In this paper we study and derive explicit formulas for the linearized Navier-Stokes equations on an exterior circular domain in space dimension two. Through an explicit construction, the solution is decomposed into an inviscid solution, a boundary layer solution and a corrector. Bounds on these solutions are given, in the appropriate Sobolev spaces, in terms of the norms of the initial and boundary data. The correction term is shown to be of the same order of magnitude as the square root of the viscosity. Copyright © 2001 by Marcel Dekker, Inc.
Application of the star-product method to the angular momentum quantization
1992
We define a *-product on ℝ3 and solve the polarization equation f*C=0 where C is the Casimir of the coadjoint representation of SO(3). We compute the action of SO(3) on the space of solutions. We then examine the case of non-zero eigenvalues of C, in order to find finite-dimensional representations of SO(3). Finally, we compute \(\sqrt C *\sqrt C \) as an asymptotic series of C. This gives an explanation of the use of the star square root of C in a paper by Bayen et al. instead of its natural square root.
Generalized centro-invertible matrices with applications
2014
Centro-invertible matrices are introduced by R.S. Wikramaratna in 2008. For an involutory matrix R, we define the generalized centro-invertible matrices with respect to R to be those matrices A such that RAR = A^−1. We apply these matrices to a problem in modular arithmetic. Specifically, algorithms for image blurring/deblurring are designed by means of generalized centro-invertible matrices. In addition, if R1 and R2 are n × n involutory matrices, then there is a simple bijection between the set of all centro-invertible matrices with respect to R1 and the set with respect to R2.
Diffusion of colloids in one-dimensional light channels
2004
Single-file diffusion (SFD), prevalent in many chemical and biological processes, refers to the one-dimensional motion of interacting particles in pores which are so narrow that the mutual passage of particles is excluded. Since the sequence of particles in such a situation remains unaffected over time t, this leads to strong deviations from normal diffusion, e.g. an increase of the particle mean-square-displacement as the square root of t. We present experimental results of the diffusive behaviour of colloidal particles in one-dimensional channels with varying particle density. The channels are realized by means of a scanning optical tweezers. Based on a new analytical approach (Kollmann 2…
Numerical Study of the semiclassical limit of the Davey-Stewartson II equations
2014
We present the first detailed numerical study of the semiclassical limit of the Davey–Stewartson II equations both for the focusing and the defocusing variant. We concentrate on rapidly decreasing initial data with a single hump. The formal limit of these equations for vanishing semiclassical parameter , the semiclassical equations, is numerically integrated up to the formation of a shock. The use of parallelized algorithms allows one to determine the critical time tc and the critical solution for these 2 + 1-dimensional shocks. It is shown that the solutions generically break in isolated points similarly to the case of the 1 + 1-dimensional cubic nonlinear Schrodinger equation, i.e., cubic…
Elements with square roots in compact groups
2010
The probability that a randomly chosen element has a square root is studied in [1, 2, 8] in the finite case. Here we deal with the infinite case.
A new mathematical function for describing electrophoretic peaks.
2005
A new model is proposed for characterizing skewed electrophoretic peaks, which is a combination of leading and trailing edge functions, empirically modified to get a rapid recovery of the baseline. The peak model is a sum of square roots and is called thereby "combined square roots (CSR) model". The flexibility of the model was checked on theoretical and experimental peaks with asymmetries in the range of 0-10 (expressed as the ratio of the distance between the center and the trailing edge, and the center and the leading edge of the chromatographic peak, measured at 10% of peak height). Excellent fits were found in all cases. The new model was compared with other three models that have show…
RootsGLOH2: embedding RootSIFT 'square rooting' in sGLOH2
2020
This study introduces an extension of the shifting gradient local orientation histogram doubled (sGLOH2) local image descriptor inspired by RootSIFT ‘square rooting’ as a way to indirectly alter the matching distance used to compare the descriptor vectors. The extended descriptor, named RootsGLOH2, achieved the best results in terms of matching accuracy and robustness among the latest state-of-the-art non-deep descriptors in recent evaluation contests dealing with both planar and non-planar scenes. RootsGLOH2 also achieves a matching accuracy very close to that obtained by the best deep descriptors to date. Beside confirming that ‘square rooting’ has beneficial effects on sGLOH2 as it happe…
RationalizeRoots: Software Package for the Rationalization of Square Roots
2019
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to find such transformations. After an introduction to the theoretical background, we explain in detail how to use the program in practice.